On Soft Architectures*

نویسندگان

چکیده

منابع مشابه

Soft-Error Tolerant Cache Architectures

The problem of soft errors caused by radiation events are expected to get worse with technology scaling. This thesis focuses on mitigation of soft errors to improve the reliability of memory caches. We survey existing mitigation techniques and discuss their issues. We then propose 1) a technique that can mitigate soft errors in caches with lower costs than the widely-used Error Correcting Code ...

متن کامل

Soft Constraints for Dependable Service Oriented Architectures

We propose the use of Soft Constraints as a natural way to model Service Oriented Architecture. In the framework, constraints are used to model components and connectors and constraint aggregation is used to represent their interactions. Moreover, a specific constraint projection operator is used to highlight the service interface. The quality of a service is measured and considered when perfor...

متن کامل

Efficient Architectures for Soft-Output Algorithms

Algorithms which compute either the APosteriori Probability (APP) or the Minimum Sequence Metric (MSM) of an input symbol to a finite state machine based on some portion of the observation sequence are developed. Full-record (i.e., type-I) and fixed-delay algorithms are both considered and related to existing algorithms. In particular, the fixed-delay APP and MSM algorithms developed are shown ...

متن کامل

ON SOFT ULTRAFILTERS

In this paper, the concept of soft ultrafilters is introduced and some of the related structures such as soft Stone-Cech compactification, principal soft ultrafilters and basis for its topology are studied.

متن کامل

Systolic Interpolation Architectures for Soft-decoding Reed-solomon Codes

We present a systolic algorithm for performing interpolation, a cornputationally intensive kernel found in algebraic soft-decoding of Reed-Solomon codes. We reformulate the interpolation algorithm, resulting in the systolic interpolation algorithm, which can compute a reduced number of candidate polynomial coefficients. Using the dependence graph of the algorithm, we realize a lowlatency interp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: e-cadernos CES

سال: 2015

ISSN: 1647-0737

DOI: 10.4000/eces.1897